Randomization, Relaxation, and Complexity
نویسندگان
چکیده
Systems of polynomial equations arise naturally in applications ranging from the study of chemical reactions to coding theory to geometry and number theory. Furthermore, the complexity of the equations we wish to solve continues to rise: while engineers in ancient Egypt needed to solve quadratic equations in one variable, today we have applications in satellite orbit design and combustive fluid flow hinging on the solution of systems of polynomial equations involving dozens or even thousands of variables.
منابع مشابه
Improving the Randomization Step in Feasibility Pump
Feasibility pump (FP) is a successful primal heuristic for mixed-integer linear programs (MILP). The algorithm consists of three main components: rounding fractional solution to a mixed-integer one, projection of infeasible solutions to the LP relaxation, and a randomization step used when the algorithm stalls. While many generalizations and improvements to the original Feasibility Pump have be...
متن کاملApproximation Algorithms
Many of the optimization problems we would like to solve are NP hard There are several ways of coping with this apparent hardness For most problems there are straightforward exhaustive search algorithms and one could try to speed up such an algorithm Techniques which can be used include divide and conquer or the re ned branch and bound which allows to eliminate part of the search tree by comput...
متن کاملRelaxation dynamics of maximally clustered networks
We study the relaxation dynamics of fully clustered networks (maximal number of triangles) to an unclustered state under two different edge dynamics-the double-edge swap, corresponding to degree-preserving randomization of the configuration model, and single edge replacement, corresponding to full randomization of the Erdős-Rényi random graph. We derive expressions for the time evolution of the...
متن کاملRelating max-cut problems and binary linear feasibility problems
This paper explores generalizations of the Goemans-Williamson randomization technique. It establishes a simple equivalence of binary linear feasibility problems and max-cut problems and presents an analysis of the semidefinite max-cut relaxation for the case of a single linear equation. Numerical examples for feasible random binary problems indicate that the randomization technique is efficient...
متن کاملCoordinated Multi-Point Transmission for Interference Mitigation in Cellular Distributed Antenna Systems
Distributed antenna systems (DASs) have been shown to improve the coverage and increase the capacity in cellular networks by reducing the access distance to user terminals (UTs) and by attaining macrodiversity gains. However, the conventional DASs do not inherently mitigate inter-cell interference. In this thesis, coordinated multi-point transmission schemes are developed for interference mitig...
متن کاملA Randomization Method for Quasi Maximum Likelihood Decoding
In Multiple-Input Multiple-Output (MIMO) systems, Maximum-Likelihood (ML) decoding is equivalent to £nding the closest lattice point in an N dimensional complex space. In [1], we have proposed several quasimaximum likelihood relaxation models for decoding in MIMO systems based on semi-de£nite programming. In this paper, we propose randomization algorithms that £nd a near-optimum solution of the...
متن کامل